Layout Optimization Method Considering Disassemblability for the Facilitation of Reuse and Recycle

نویسندگان

  • Masakazu Kobayashi
  • Masatake Higashi
چکیده

1. Abstract Due to rise of environmental awareness and enactment of legislation in recent years, products that reach their end-of-life need to be collected, disassembled and reused / recycled. However, since every component that comprises a product is not reused / recycled from a cost effective standpoint, a product needs not be completely disassembled and only components to be reused / recycled need to be removed from a product with less disassembly cost and work. The number of tasks required to remove each component from the product is seriously affected by layout of components comprising a product. Since component layout is roughly decided during conceptual design phase, it is desirable to decide components layout with consideration of disassembability during conceptual design phase. In this research, layout design during conceptual design phase is focused on and a new method of optimizing component layout considering its disassemblability is developed. In the proposed method, sequence triple is used to represent a three-dimensional component layout. To evaluate disassemblability of a layout, fitness function is defined based on the number of tasks required to remove components from a product and the value of those components. Optimal layout is explored by using genetic algorithm. In the case study, the proposed method is applied to an example calculation and layout design of internal devices of a laptop computer. 2.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A HYBRID ALGORITHM FOR SIZING AND LAYOUT OPTIMIZATION OF TRUSS STRUCTURES COMBINING DISCRETE PSO AND CONVEX APPROXIMATION

An efficient method for size and layout optimization of the truss structures is presented in this paper. In order to this, an efficient method by combining an improved discrete particle swarm optimization (IDPSO) and method of moving asymptotes (MMA) is proposed. In the hybrid of IDPSO and MMA, the nodal coordinates defining the layout of the structure are optimized with MMA, and afterwards the...

متن کامل

A heuristic method for combined optimization of layout design and cluster configuration in continuous productions

Facility layout problems have been generally solved either hierarchically or integrated into other phases of plant design. In this paper, a hybrid method is introduced so that clustering and facilities layout can be simultaneously optimized. Each cluster is formed by a group of connected facilities and selection of the most appropriate cluster configuration is aimed. Since exact method by MIP i...

متن کامل

TOPOLOGY OPTIMIZATION OF PRETENSIONED CONCRETE BEAMS CONSIDERING MATERIAL NONLINEARITY

In this paper, the bi-directional evolutionary structural optimization (BESO) method is used to find optimal layouts of 3D prestressed concrete beams. Considering the element sensitivity number as the design variable, the mathematical formulation of topology optimization is developed based on the ABAQUS finite element software package. The surface-to-surface contact with a small sliding between...

متن کامل

A NEW MEMETIC SWARM OPTIMIZATION FOR SPECTRAL LAYOUT DESIGN OF BRACED FRAMES

For most practical purposes, true topology optimization of a braced frame should be synchronized with its sizing. An integrated layout optimization is formulated here to simultaneously account for both member sizing and bracings’ topology in such a problem. Code-specific seismic design spectrum is applied to unify the earthquake excitation. The problem is solved for minimal structural weight un...

متن کامل

A Continuous Plane Model to Machine Layout Problems Considering Pick-Up and Drop-Off Points: An Evolutionary Algorithm

One of the well-known evolutionary algorithms inspired by biological evolution is genetic algorithm (GA) that is employed as a robust and global optimization tool to search for the best or near-optimal solution with the search space. In this paper, this algorithm is used to solve unequalsized machines (or intra-cell) layout problems considering pick-up and drop-off (input/output) points. Such p...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013